Hierarchy of closures of matrix pencils
نویسنده
چکیده
The focus of this paper is the standard linear representation of the group SLn(C)×SLm(C)×SL2(C), that is, the tensor product of the corresponding tautological representations. Classification of its orbits is a classic problem, which goes back to the works of Kronecker and Weierstrass. Here, we summarize some known results about standard linear representations of SLn(C) × SLm(C) × SL2(C), GLn(C) × GLm(C), SLn(C) × SLm(C), and GLn(C) × GLm(C) × GL2(C), classify the orbits and describe their degenerations. For the case n 6= m , we prove that the algebras of invariants of the actions of SLn(C)× SLm(C)× SL2(C) and SLn(C)× SLm(C) are generated by one polynomial of degree nm/|n−m| , if d = |n−m| divides n (or m), and are trivial otherwise. It is also shown that the null cone of SLn(C) × SLm(C) × SL2(C) is irreducible and contains an open orbit if n 6= m . We relate the degenerations of orbits of matrix pencils to the degenerations of matrix pencil bundles and prove that the closure of a matrix pencil bundle consists of closures of the corresponding orbits and closures of their amalgams. From this fact we derive the degenerations of orbits of the four groups listed above. All degenerations are cofined to the list of minimal degenerations, which are summarized as transformations of Ferrer diagrams. We tabulate the orbits of matrix pencils up to seventh order and portray the hierarchy of closures of 2× 2, 3× 3, 4× 4, 5× 5, 5× 6 and 6× 6 matrix pencil bundles.
منابع مشابه
On the closures of orbits of fourth order matrix pencils
In this work we state a simple criterion for nilpotentness of a square n×n matrix pencil with respect to the action of SLn(C)×SLn(C)×SL2(C). The orbits of matrix pencils are classified explicitly for n = 4 and the hierarchy of closures of nilpotent orbits is described. Also, we prove that the algebra of invariants of the action of SLn(C)× SLn(C)× SL2(C) on C ⊗ C ⊗ C is isomorphic to the algebra...
متن کاملOrbit Closures of Singular Matrix Pencils
Equivalence of matrix pencils (pairs of pq matrices over C) is given by the GL p GL q-action of simultaneous left and right multiplication. The orbits under this group action were described by Kronecker in 1890 in terms of pencil invariants: column indices, row indices, and elementary divisors. In this paper we describe the topological closures of these orbits, a problem motivated by our work i...
متن کاملOn the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition
Under the action of the general linear group, the ranks of matrices A and B forming a m × n pencil A+ λB can change, but in a restricted manner. Specifically, to every pencil one can associate a pair of minimal ranks, which is unique up to a permutation. This notion can be defined for matrix pencils and, more generally, also for matrix polynomials of arbitrary degree. The natural hierarchy it i...
متن کاملTools for Structured Matrix Computations: Stratifications and Coupled Sylvester Equations
Developing theory, algorithms, and software tools for analyzing matrix pencils whose matrices have various structures are contemporary research problems. Such matrices are often coming from discretizations of systems of differential-algebraic equations. Therefore preserving the structures in the simulations as well as during the analyses of the mathematical models typically means respecting the...
متن کاملComputation and presentation of graphs displaying closure hierarchies of Jordan and Kronecker structures
StratiGraph, a Java-based tool for computation and presentation of closure hierarchies of Jordan and Kronecker structures is presented. The tool is based on recent theoretical results on strati=cations of orbits and bundles of matrices and matrix pencils. A strati=cation reveals the complete hierarchy of nearby structures, information critical for explaining the qualitative behaviour of linear ...
متن کامل